Solvability Theory and Iteration Method for One Self-Adjoint Polynomial Matrix Equation

Algebraic adjoint of the polynomials-polynomial matrix multiplication

This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field

The variational iteration method for solving Nagumo telegraph equation

Symmetric Matrix Polynomial Equation

A new numerical procedure is proposed to solve the symmetric matrix polynomial equation A T (?s)X(s) + X T (?s)A(s) = 2B(s) that is frequently encountered in control and signal processing. It is based on interpolation and takes fully advantage of symmetry of the equation by reducing the original problem dimension. The algorithm is more eecient and more general than older methods and, namely, it...

A Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

Sinc operational matrix method for solving the Bagley-Torvik equation

The aim of this paper is to present a new numerical method for solving the Bagley-Torvik equation. This equation has an important role in fractional calculus. The fractional derivatives are described based on the Caputo sense. Some properties of the sinc functions required for our subsequent development are given and are utilized to reduce the computation of solution of the Bagley-Torvik equati...